On the decomposition of cyclic codes into cyclic classes
نویسندگان
چکیده
منابع مشابه
On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
Picking up exactly one member from each of the nonperiodic cyclic equivalence classes of an (n, k + 1) Reed-Solomon code E over GF(q) gives a code, E”, which has bounded Hamming correlation values and the self-synchronizing property. The exact size of E” is shown to be t Cdln p(d)~~~+[$], where p(d) is the Miibius function, [z] is the integer part of 5, and the summation is over all the divisor...
متن کاملSeveral classes of optimal ternary cyclic codes
Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight new classes of optimal ternary cyclic codes with parameters [3−1, 3−1−2m, 4], according to a result on the non-existence of solutions to a certain equation o...
متن کاملCyclic Orbit Codes with the Normalizer of a Singer Subgroup
An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملon the girth of tanner (3,7) quasi-cyclic ldpc codes
s. kim et al. have been analyzed the girth of some algebraically structured quasi-cyclic (qc) low-density parity-check (ldpc) codes, i.e. tanner $(3,5)$ of length $5p$, where $p$ is a prime of the form $15m+1$. in this paper, by extension this method to tanner $(3,7)$ codes of length $7p$, where $p$ is a prime of the form $21m+ 1$, the girth values of tanner $(3,7...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1971
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(71)90446-3